Geometric Hashing: An Overview
نویسنده
چکیده
1
منابع مشابه
Improving Geometric Hashing by Means of Feature Descriptors
Geometric Hashing is a well-known technique for object recognition. This paper proposes a novel method aimed at improving the performance of Geometric Hashing in terms of robustness toward occlusion and clutter. To this purpose, it employs feature descriptors to notably decrease the amount of false positives that generally arise under these conditions. An additional advantage of the proposed te...
متن کاملDelta B+ Tree: Indexing 3D Point Sets for Pattern Discovery
Three-dimensional point sets can be used to represent data in different domains. Given a database of 3D point sets, pattern discovery looks for similar subsets that occur in multiple point sets. Geometric hashing proved to be an effective technique in discovering patterns in 3D point sets. However, there are also known shortcomings. We propose a new indexing technique called B Trees. It is an e...
متن کاملProtein-Protein Interaction Design with Geometric Hashing Computational Geometry
Protein-protein interactions (PPIs) are important for cell signaling, forming macromolecular scaffolds and complexes, gene expression, and many other biological functions. PPIs are often used as biological probes in experiments, such as with biosensors, and have become vital to understanding biological function. One potential method to study the function of PPIs is to design novel PPIs. One pos...
متن کاملGeometric Invariant Robust Image Hashing Via Zernike Moment
Robust image hashing methods require the robustness to content preserving processing and geometric transform. Zernike moment is a local image feature descriptor whose magnitude components are rotationally invariant and most suitable for image hashing application. In this paper, we proposed Geometric invariant robust image hashing via zernike momment. Normalized zernike moments of an image are u...
متن کامل2- and 3-Dimensional Geometric Hashing with Points and Lines
In this paper we compare our 3-D geometric hashing approach to object recognition to a 2-D geometric hashing approach developed by Gavrila and Groen. We apply both methods to same recognition task using real images. We found that the indexing technique used in geometric hashing is much more eecient in the 3-D case than it is in the 2-D case. Furthermore, the use of aspect models and more comple...
متن کامل